28B - pSort - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define w     \
    int t;    \
    cin >> t; \
    while (t--)
#define v(n) \
    int n;   \
    cin >> n;
#define pb push_back
#define vi(name, size)             \
    vector<int> name(size);        \
    for (int i = 0; i < size; i++) \
        cin >> name[i];
#define f(n) for (int i = 0; i < n; i++)
#define all(vv) vv.begin(), vv.end()
#define pri(vv)                             \
    f(vv.size()) cout << vv[i] << char(32); \
    cout << endl;
const int N = 555555;
int fa[N], n, a[N], d[N];
int find(int x)
{
    return fa[x] == x ? fa[x] : fa[x] = find(fa[x]);
}
int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> n;

    for (int i = 0; i <= n * n; i++)
    {
        fa[i] = i;
    }

    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }

    for (int i = 1; i <= n; i++)
    {
        cin >> d[i];

        int l = i - d[i], r = i + d[i];

        if (l >= 1)
        {
            fa[find(l)] = find(i);
        }

        if (r <= n)
        {
            fa[find(r)] = find(i);
        }
    }

    for (int i = 1; i <= n; i++)
    {
        if (find(a[i]) != find(i))
        {
            cout << "NO";

            return 0;
        }
    }

    cout << "YES";

    return 0;
}